Coding for a binary independent piecewise-identically-distributed source
نویسنده
چکیده
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
منابع مشابه
A non-linear dynamical systems approach to source compression for constrained sources
We have recently established a strong connection between the Tent map (also known as Generalized Luroth Series or GLS which is a chaotic, ergodic and lebesgue measure preserving non-linear dynamical system) and Arithmetic coding which is a popular source compression algorithm used in international compression standards such as JPEG2000 and H.264. This was for independent and identically distrib...
متن کاملHigher moments portfolio Optimization with unequal weights based on Generalized Capital Asset pricing model with independent and identically asymmetric Power Distribution
The main criterion in investment decisions is to maximize the investors utility. Traditional capital asset pricing models cannot be used when asset returns do not follow a normal distribution. For this reason, we use capital asset pricing model with independent and identically asymmetric power distributed (CAPM-IIAPD) and capital asset pricing model with asymmetric independent and identically a...
متن کاملA coding theorem for lossy data compression by LDPC codes
In this correspondence, low-density parity-check (LDPC) codes are applied to lossy source coding and we study how the asymptotic performance of MacKay’s LDPC codes depends on the sparsity of the parity-check matrices in the source coding of the binary independent and identically distributed (i.i.d.) source with Pr = 1 = 0 5. In the sequel, it is shown that an LDPC code with column weight (log )...
متن کاملA random coding theorem for "modulo-two adder" source network
Suppose (X ,Y ) is a pair of sequence of independent and identically distributed samples from a binary symmetric source. Using linear random codes, Korner and Morton [1] showed that the modulotwo sum sequence Z = X ⊕Y can be described to a common decoder at rates Rx, Ry , and Rz bits iff Rx + Rz > H(Z) and Ry + Rz > H(Z) where H(Z) is the entropy of the random variable Z . Here we provide an al...
متن کاملSimple one-shot bounds for various source coding problems using smooth Rényi quantities
We consider the problem of source compression under three different scenarios in the one-shot (nonasymptotic) regime. To be specific, we prove one-shot achievability and converse bounds on the coding rates for distributed source coding, source coding with coded side information available at the decoder and source coding under maximum distortion criterion. The one-shot bounds obtained are in ter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996